Auction Protocols for Decentralized Scheduling

نویسندگان

  • Michael P. Wellman
  • William E. Walsh
  • Peter R. Wurman
  • Jeffrey K. MacKie-Mason
چکیده

Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributed bidding protocols to determine schedules. We investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solutions, and the behavior of an ascending auction mechanism and bidding protocol. To remedy the potential nonexistence of price equilibria due to complementarities in preference, we introduce additional markets in combinations of basic goods. Finally, we consider direct revelation mechanisms, and compare to the market-based approach. Journal of Economic Literature Classification Numbers: C62, C70, D44.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

To appear in Games and Economic Behavior Auction Protocols for Decentralized Scheduling

Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributed bidding protocols to determine schedules. We investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solution...

متن کامل

Adsche: Design of an Auction-Based Framework for Decentralized Scheduling

Decentralized scheduling is one of the newly emerged avenues in scheduling research. It is concerned with allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Compared with classical scheduling models, decentralized scheduling is characterized with the distribution of scheduling knowledge and control, which introduces new levels...

متن کامل

An Auction-based Approach for Decentralized Multi-Project Scheduling: (Doctoral Consortium)

Many scheduling problems in industry practice are considered as Decentralized Resource-Constrained Multi-Project Scheduling Problem (DRCMPSP). Given its characteristics, the problem must be solved in a decentralized manner while respecting information privacy of projects. However, existing approaches fail in satisfying these requirements, and encounter difficulties in dealing with large cases. ...

متن کامل

An auction based approach in decentralized project scheduling

We consider project scheduling problems on a decentralized decisional framework, where a project is partitioned into different sub-projects each one managed by a local decision maker. A coordination mechanism has to be considered to resolve shared resource allocation conflicts between different sub-projects. We propose a multi agent system model to represent the decentralized decisional problem...

متن کامل

On combinatorial auction and Lagrangean relaxation for distributed resource scheduling

Most existing methods for scheduling are based on centralized or hierarchical decision making using monolithic models. In this study, we investigate a new method based on a distributed and locally autonomous decision structure using the notion of combinatorial auction. In combinatorial auction the bidders demand a combination of dependent objects with a single bid. We show that not only can we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2001